Closed form Solution for Scheduling Arbitrarily Divisible Load Model in Data Grid Applications: Multiple Sources
نویسندگان
چکیده
Scheduling an application in data grid was significantly complex and very challenging because of its heterogeneous in nature of the grid system. When the Divisible Load Theory (DLT) model had emerged as a powerful model for modeling data-intensive grid problem, Task Data Present (TDP) model was proposed based on it. This study presented a new Adaptive TDP (ATDP) for scheduling the intensive grid applications. New closed form solution for obtaining the load allocation was derived while computation speeds and communication links are heterogeneous. Experimental results showed that the proposed model can balance the load efficiently.
منابع مشابه
New Optimal Load Allocation for Scheduling Divisible Data Grid Applications
In many data grid applications, data can be decomposed into multiple independent sub-datasets and distributed for parallel execution and analysis. This property has been successfully employed by using Divisible Load Theory (DLT), which has been proved as a powerful tool for modeling divisible load problems in data-intensive grid. There are some scheduling models have been studied but no optimal...
متن کاملOptimal workload allocation model for scheduling divisible data grid applications
Problem statement: In many data grid applications, data can be decomposed into multiple independent sub-datasets and distributed for parallel execution and analysis. Approach: This property had been successfully employed by using Divisible Load Theory (DLT), which had been proved as a powerful tool for modeling divisible load problems in data-intensive grid. Results: There were some scheduling ...
متن کاملGrid scheduling divisible loads from two sources
To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks w...
متن کاملDeadline-Based Scheduling Algorithm for Divisible-Load in Grid Computing
The divisible load model is motivated by divisible load theory, where both communication and computation can be arbitrarily divisible into as many independent partitions as required and facilitates a good approximation for many real-world application systems such as those arising in large physics experiments. Scheduling an application with divisible load in data grid is significantly important ...
متن کاملAdaptive Divisible Load Model for Scheduling Data-Intensive Grid Applications
In many data grid applications, data can be decomposed into multiple independent sub datasets and schedule for parallel execution and analysis. Divisible Load Theory (DLT) is a powerful tool for modelling data-intensive grid problems where both communication and computation load is partitionable. This paper presents an Adaptive DLT (ADLT) model for scheduling data-intensive grid applications. T...
متن کامل